By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 17, Issue 5, pp. 849-1061

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel

Mikhail J. Atallah and S. Rao Kosaraju

pp. 849-869

Probing Convex Polygons with X-rays

Herbert Edelsbrunner and Steven S. Skiena

pp. 870-882

Deferred Data Structuring

Richard M. Karp, Rajeev Motwani, and Prabhakar Raghavan

pp. 883-902

On Sets Truth-Table Reducible to Sparse Sets

Ronald V. Book and Ker-I Ko

pp. 903-919

An Approximation Scheme for Finding Steiner Trees with Obstacles

J. Scott Provan

pp. 920-934

Nondeterministic Space is Closed under Complementation

Neil Immerman

pp. 935-938

Varieties of Iteration Theories

Stephen L. Bloom and Zoltan Esik

pp. 939-966

On the Complexity of Computing the Volume of a Polyhedron

M. E. Dyer and A. M. Frieze

pp. 967-974

Fault Tolerance in Networks of Bounded Degree

Cynthia Dwork, David Peleg, Nicholas Pippenger, and Eli Upfal

pp. 975-988

Natural Self-Reducible Sets

Alan L. Selman

pp. 989-996

Axiomatising Finite Concurrent Processes

Matthew Hennessy

pp. 997-1017

A Linear Algorithm for Topological Bandwidth in Degree-Three Trees

Zevi Miller

pp. 1018-1035

Optimal Bounds for Solving Tridiagonal Systems with Preconditioning

Paolo Zellini

pp. 1036-1043

Average-Case Lower Bounds for Searching

Colin McDiarmid

pp. 1044-1060

Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

Robert E. Tarjan and Christopher J. Van Wyk

p. 1061